Hmm Based Fast Keyword Spotting Algorithm with No Garbage Modeliis

\ , I \ I I The problem Of discriminating keyword and non-keyword speech which is important in wordspotting applications is addressed here. We have shown that garbage models cannot reduce both rejection and false alarm rates simultaneously. Thus, the following relation becomes apparent from the above inequalities O'In I ) > " ( o ' l l P ) . P(08 I R P ) > p(oP I R 1 ) (4) TO achieve this we have proposed a new Scoring and search method for HMM based wordspotting without garbage models. This is a simple fonvard search method which incorporates the duration modelling of keyword for efficient discrimination of keyword and non-keyword speech. This method is computationally fast, which makes it suitable for real-time implementation. The results are reported on a speaker independent database containing 10 keywords embedded in 150 camer sentences.